n,m=map(int,input().split())
arr=[list(map(int,input().split())) for r in range(n)]
a,b=map(int,input().split())
mx=10000000;
for i in range(n-a+1):
for j in range(m-b+1):
count=0;
for w in range(i,i+a):
for e in range(j,j+b):
count+=arr[w][e]
mx=min(mx,count)
for i in range(n-b+1):
for j in range(m-a+1):
count=0;
for w in range(i,i+b):
for e in range(j,j+a):
count+=arr[w][e]
mx=min(mx,count)
print(mx)215. Kth Largest Element in an Array | 198. House Robber |
153. Find Minimum in Rotated Sorted Array | 150. Evaluate Reverse Polish Notation |
144. Binary Tree Preorder Traversal | 137. Single Number II |
130. Surrounded Regions | 129. Sum Root to Leaf Numbers |
120. Triangle | 102. Binary Tree Level Order Traversal |
96. Unique Binary Search Trees | 75. Sort Colors |
74. Search a 2D Matrix | 71. Simplify Path |
62. Unique Paths | 50. Pow(x, n) |
43. Multiply Strings | 34. Find First and Last Position of Element in Sorted Array |
33. Search in Rotated Sorted Array | 17. Letter Combinations of a Phone Number |
5. Longest Palindromic Substring | 3. Longest Substring Without Repeating Characters |
1312. Minimum Insertion Steps to Make a String Palindrome | 1092. Shortest Common Supersequence |
1044. Longest Duplicate Substring | 1032. Stream of Characters |
987. Vertical Order Traversal of a Binary Tree | 952. Largest Component Size by Common Factor |
212. Word Search II | 174. Dungeon Game |